Charlemagne's Challenge: The Periodic Latency Problem
Identifieur interne : 000406 ( Main/Exploration ); précédent : 000405; suivant : 000407Charlemagne's Challenge: The Periodic Latency Problem
Auteurs : Sofie Coene [Belgique] ; Frits C. R. Spieksma [Belgique] ; Gerhard J. Woeginger [Pays-Bas]Source :
- Operations research [ 0030-364X ] ; 2011.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Latency problems are characterized by their focus on minimizing the waiting time for all clients. We study periodic latency problems, a nontrivial extension of standard latency problems. In a periodic latency problem each client has to be visited regularly: there is a server traveling at unit speed, and there is a set of n clients with given positions. The server must visit the clients over and over again, subject to the constraint that successive visits to client i are at most qi time units away from each other. We investigate two main problems. In problem PLPP the goal is to find a repeatable route for the server visiting as many clients as possible without violating their qis. In problem PLP the goal is to minimize the number of servers needed to serve all clients. Depending on the topology of the underlying network, we derive polynomial-time algorithms or hardness results for these two problems. Our results draw sharp separation lines between easy and hard cases.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000011
- to stream PascalFrancis, to step Curation: 000029
- to stream PascalFrancis, to step Checkpoint: 000010
- to stream Main, to step Merge: 000409
- to stream Main, to step Curation: 000406
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Charlemagne's Challenge: The Periodic Latency Problem</title><author><name sortKey="Coene, Sofie" sort="Coene, Sofie" uniqKey="Coene S" first="Sofie" last="Coene">Sofie Coene</name><affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Operations Research Group, Katholieke Universiteit Leuven</s1><s2>3000 Leuven</s2><s3>BEL</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Belgique</country><placeName><region type="province" nuts="2">Province du Brabant flamand</region><settlement type="city">Louvain</settlement></placeName><orgName type="university">Katholieke Universiteit Leuven</orgName></affiliation></author><author><name sortKey="Spieksma, Frits C R" sort="Spieksma, Frits C R" uniqKey="Spieksma F" first="Frits C. R." last="Spieksma">Frits C. R. Spieksma</name><affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Operations Research Group, Katholieke Universiteit Leuven</s1><s2>3000 Leuven</s2><s3>BEL</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Belgique</country><placeName><region type="province" nuts="2">Province du Brabant flamand</region><settlement type="city">Louvain</settlement></placeName><orgName type="university">Katholieke Universiteit Leuven</orgName></affiliation></author><author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Mathematics, Eindhoven University of Technology</s1><s2>5600 MB Eindhoven</s2><s3>NLD</s3><sZ>3 aut.</sZ></inist:fA14><country>Pays-Bas</country><wicri:noRegion>5600 MB Eindhoven</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">11-0343000</idno><date when="2011">2011</date><idno type="stanalyst">PASCAL 11-0343000 INIST</idno><idno type="RBID">Pascal:11-0343000</idno><idno type="wicri:Area/PascalFrancis/Corpus">000011</idno><idno type="wicri:Area/PascalFrancis/Curation">000029</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000010</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000010</idno><idno type="wicri:doubleKey">0030-364X:2011:Coene S:charlemagne:s:challenge</idno><idno type="wicri:Area/Main/Merge">000409</idno><idno type="wicri:Area/Main/Curation">000406</idno><idno type="wicri:Area/Main/Exploration">000406</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Charlemagne's Challenge: The Periodic Latency Problem</title><author><name sortKey="Coene, Sofie" sort="Coene, Sofie" uniqKey="Coene S" first="Sofie" last="Coene">Sofie Coene</name><affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Operations Research Group, Katholieke Universiteit Leuven</s1><s2>3000 Leuven</s2><s3>BEL</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Belgique</country><placeName><region type="province" nuts="2">Province du Brabant flamand</region><settlement type="city">Louvain</settlement></placeName><orgName type="university">Katholieke Universiteit Leuven</orgName></affiliation></author><author><name sortKey="Spieksma, Frits C R" sort="Spieksma, Frits C R" uniqKey="Spieksma F" first="Frits C. R." last="Spieksma">Frits C. R. Spieksma</name><affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Operations Research Group, Katholieke Universiteit Leuven</s1><s2>3000 Leuven</s2><s3>BEL</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Belgique</country><placeName><region type="province" nuts="2">Province du Brabant flamand</region><settlement type="city">Louvain</settlement></placeName><orgName type="university">Katholieke Universiteit Leuven</orgName></affiliation></author><author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Mathematics, Eindhoven University of Technology</s1><s2>5600 MB Eindhoven</s2><s3>NLD</s3><sZ>3 aut.</sZ></inist:fA14><country>Pays-Bas</country><wicri:noRegion>5600 MB Eindhoven</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Operations research</title><title level="j" type="abbreviated">Oper. res.</title><idno type="ISSN">0030-364X</idno><imprint><date when="2011">2011</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Operations research</title><title level="j" type="abbreviated">Oper. res.</title><idno type="ISSN">0030-364X</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Hardness</term><term>Latency</term><term>Multiserver queue</term><term>Periodicity</term><term>Polynomial method</term><term>Polynomial time</term><term>Routing</term><term>Topology</term><term>Waiting time</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Latence</term><term>Temps attente</term><term>Routage</term><term>File n serveurs</term><term>Topologie</term><term>Méthode polynomiale</term><term>Temps polynomial</term><term>Dureté</term><term>Périodicité</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Latency problems are characterized by their focus on minimizing the waiting time for all clients. We study periodic latency problems, a nontrivial extension of standard latency problems. In a periodic latency problem each client has to be visited regularly: there is a server traveling at unit speed, and there is a set of n clients with given positions. The server must visit the clients over and over again, subject to the constraint that successive visits to client i are at most q<sub>i</sub> time units away from each other. We investigate two main problems. In problem PLPP the goal is to find a repeatable route for the server visiting as many clients as possible without violating their q<sub>i</sub>s. In problem PLP the goal is to minimize the number of servers needed to serve all clients. Depending on the topology of the underlying network, we derive polynomial-time algorithms or hardness results for these two problems. Our results draw sharp separation lines between easy and hard cases.</div></front></TEI><affiliations><list><country><li>Belgique</li><li>Pays-Bas</li></country><region><li>Province du Brabant flamand</li></region><settlement><li>Louvain</li></settlement><orgName><li>Katholieke Universiteit Leuven</li></orgName></list><tree><country name="Belgique"><region name="Province du Brabant flamand"><name sortKey="Coene, Sofie" sort="Coene, Sofie" uniqKey="Coene S" first="Sofie" last="Coene">Sofie Coene</name></region><name sortKey="Spieksma, Frits C R" sort="Spieksma, Frits C R" uniqKey="Spieksma F" first="Frits C. R." last="Spieksma">Frits C. R. Spieksma</name></country><country name="Pays-Bas"><noRegion><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/ChansonRoland/explor/ChansonRolandV7/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000406 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000406 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= ChansonRoland
|area= ChansonRolandV7
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:11-0343000
|texte= Charlemagne's Challenge: The Periodic Latency Problem
}}
| This area was generated with Dilib version V0.6.39. |  |